随机滤波模型在变速箱剩余寿命预测中的应用研究

摘要：基于变速箱加速寿命实验的振动信号,提取信号的多种特征参量．通过分析各特征参量的敏感性和稳定性,选择幅域裕度指标、峰值指标、波形指标和RMS（RootMeanSquare）作为特征参量,建立一种基于随机滤波的变速箱剩余寿命预测模型,给出剩余寿命后验概率密度的递推公式,设计了极大似然估计方法求解模型参数,并经实例验证模型的有效性和实用性．     

随机共振在微弱信号检测中的数值仿真

对基于非线性双稳系统随机共振的微弱信号检测技术进行数值研究,利用随机共振机制,浸入在噪声中的微弱信号可以得到有效的放大与增强。给出了基于Runge Kutta算法的双稳系统随机共振模型的求解方法,提出了利用随机共振检测微弱非周期信号的一种新思路。数值仿真结果表明,该方法不仅可以检测出强噪声极低频的微弱周期信号,而且可以对非周期信号进行有效的检测。     

具有变时滞的离散型随机BAM神经网络的稳定性

研究一类具有变时滞的离散型随机BAM神经网络。通过构造Lyapunov泛函以及线性矩阵不等式（LMI）,得出了离散系统全局渐近稳定的充分条件。     

基于随机网络的平均维修保障服务时间分析

利用随机网络建模方法在随机工程项目分析中的优越性,建立了不同保障方式下的维修保障过程模型。重点对网络活动中的维修等待时间和维修等待概率进行了分析,利用随机网络的解析算法,确定了维修力量的平均维修保障服务时间分析模型。最后将该方法应用于伴随修理过程,对其平均维修保障服务时间进行了案例分析。     

轮式装甲车辆的几何通过性建模与仿真

介绍了轮式装甲车辆通过障碍物的规则,分析了几何障碍物属性和通过判断条件,针对几何障碍物属性,提出了几何障碍物的通过算法,建立了几何通过性模型。采用VC＋＋编程对模型进行了仿真,通过仿真实验验证了算法和模型的可行性。     

几何内蕴量对拉伸模具工作面力学性能的影响

曲率、度规不变量、凸凹性等几何内蕴量的不均匀分布直接影响模具的力学性能。本文研究了曲率与变形能、曲率与摩擦耗损功、度规不变量与热辐射、凸凹分布与辐射热通量等几何内蕴量与力学量之间的关系。结果表明:复杂曲面表面高斯曲率的不连续分布将导致表面的变形能、摩擦耗损功出现相应的不连续分布;型面上沿拉伸方向截面线的法曲率越小,摩擦耗损功越大;型面上的热通量会随着拐点数量的增加而增加。这些结果为模具表面优化设计提供了新的理论依据。     

Approximating nondominated sets in continuous multiobjective optimization problems

Many important problems in Operations Research and Statistics require the computation of nondominated (or Pareto or efficient) sets. This task may be currently undertaken efficiently for discrete sets of alternatives or for continuous sets under special and fairly tight structural conditions. Under more general continuous settings, parametric characterisations of the nondominated set, for example through convex combinations of the objective functions or ε‐constrained problems, or discretizations‐based approaches, pose several problems. In this paper, the lack of a general approach to approximate the nondominated set in continuous multiobjective problems is addressed. Our simulation‐based procedure only requires to sample from the set of alternatives and check whether an alternative dominates another. Stopping rules, efficient sampling schemes, and procedures to check for dominance are proposed. A continuous approximation to the nondominated set is obtained by fitting a surface through the points of a discrete approximation, using a local (robust) regression method. Other actions like clustering and projecting points onto the frontier are required in nonconvex feasible regions and nonconnected Pareto sets. In a sense, our method may be seen as an evolutionary algorithm with a variable population size. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Optimal power control in a wireless network using a model with stochastic link coefficients

This paper addresses optimal power allocation in a wireless communication network under uncertainty. The paper introduces a framework for optimal transmit power allocation in a wireless network where both the useful and interference coefficients are random. The new approach to power control is based on a stochastic programming formulation with probabilistic SIR constraints. This allows to state the power allocation problem as a convex optimization problem assuming normally or log‐normally distributed communication link coefficients. Numerical examples illustrate the performance of the optimal stochastic power allocation. A distributed algorithm for the decentralized solution of the stochastic power allocation problem is discussed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

编队协同反导决策方案优选

为了充分地调度好编队全部的抗导资源,实现抗导弹群的成功概率最大,在利用随机服务系统理论对编队协同反导决策方案各指标值进行计算的基础上,将"模糊优选理论"与"协同学原理"有机地结合起来,求解了在反舰导弹到达强度与舰空导弹的单发杀伤概率在不同值的情况下,编队协同反导决策方案的隶属度,为编队指挥员进行反导决策方案的优选提供了科学依据。